package com.test.leetcode;

/**
 * https://leetcode.cn/problems/integer-break/description/
 * @author sujiafa
 * @date 2025/4/10
 */
public class n343_整数拆分 {
    public int integerBreak(int n) {
        int[] dp = new int[n + 1];
        dp[2] = 1;
        for (int i = 3; i <= n; i++) {
            for (int j = 2; j < i; j++) {
                dp[i] = Math.max(dp[i], Math.max(j * (i - j), j * dp[i - j]));
            }
        }

        return dp[n];
    }
}
